Recursive Abstractions for Parameterized Systems
نویسندگان
چکیده
We consider a language of recursively defined formulas about arrays of variables, suitable for specifying safety properties of parameterized systems. We then present an abstract interpretation framework which translates a paramerized system as a symbolic transition system which propagates such formulas as abstractions of underlying concrete states. The main contribution is a proof method for implications between the formulas, which then provides for an implementation of this abstract interpreter.
منابع مشابه
On Decision Procedures for Algebraic Data Types with Abstractions
We describe a parameterized decision procedure that extends the decision procedure for functional recursive algebraic data types (trees) with the ability to specify and reason about abstractions of data structures. The abstract values are specified using recursive abstraction functions that map trees into other data types that have decidable theories. Our result yields a decidable logic which c...
متن کاملFuzzy adaptive tracking control for a class of nonlinearly parameterized systems with unknown control directions
This paper addresses the problem of adaptive fuzzy tracking control for aclass of nonlinearly parameterized systems with unknown control directions.In this paper, the nonlinearly parameterized functions are lumped into the unknown continuous functionswhich can be approximated by using the fuzzy logic systems (FLS) in Mamdani type. Then, the Nussbaum-type function is used to de...
متن کاملA Parameterized Unfold/Fold Transformation Framework for De nite Logic Programs
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0, P1, : : : , Pn, such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding u...
متن کاملA Parameterized Unfold / FoldTransformation Framework for De niteLogic
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0 , P1 , : : : , Pn , such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for deenite logic programs diier from one another mainly in the kind of folding transformations they permit at each step. Some allow foldin...
متن کاملADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM
In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009